Generalized K-Core Percolation in Networks with Community Structure
نویسندگان
چکیده
منابع مشابه
Percolation on random networks with arbitrary k-core structure.
The k-core decomposition of a network has thus far mainly served as a powerful tool for the empirical study of complex networks. We now propose its explicit integration in a theoretical model. We introduce a hard-core random network (HRN) model that generates maximally random networks with arbitrary degree distribution and arbitrary k-core structure. We then solve exactly the bond percolation p...
متن کاملGeneralized model for k-core percolation and interdependent networks.
Cascading failures in complex systems have been studied extensively using two different models: k-core percolation and interdependent networks. We combine the two models into a general model, solve it analytically, and validate our theoretical results through extensive simulations. We also study the complete phase diagram of the percolation transition as we tune the average local k-core thresho...
متن کاملDynamics of k-core percolation
In many network applications nodes are stable provided they have at least k neighbours, and a network of k-stable nodes is called a k-core. The vulnerability to random attack is characterized by the size of culling avalanches which occur after a randomly chosen k-core node is removed. Simulations of lattices in two, three and four dimensions, as well as small-world networks, indicate that power...
متن کاملExpansion for k-Core Percolation
The physics of k-core percolation pertains to those systems whose constituents require a minimum number of k connections to each other in order to participate in any clustering phenomenon. Examples of such a phenomenon range from orientational ordering in solid ortho-para H2 mixtures to the onset of rigidity in barjoint networks to dynamical arrest in glass-forming liquids. Unlike ordinary (k=1...
متن کاملTricritical point in heterogeneous k-core percolation.
k-core percolation is an extension of the concept of classical percolation and is particularly relevant to understanding the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with heterogeneous k-cores, where each vertex is assigned a local threshold k(i). In this Letter we identify a binary mixture of heterogeneous k-cores which e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Applied Mathematics
سال: 2020
ISSN: 0036-1399,1095-712X
DOI: 10.1137/19m1290607